Python for education: the exact cover problem
نویسنده
چکیده
Python implementation of Algorithm X by Knuth is presented. Algorithm X finds all solutions to the exact cover problem. The exemplary results for pentominoes, Latin squares and Sudoku are given.
منابع مشابه
Fast Nearest Neighbors
We present a review of the literature on fast nearest neighbors using the basic approach from Karger and Ruhl [4] and a recent technique called cover trees. A small error in Insert procedure from the original paper on cover trees is corrected and an examination of how query time actually varies with the size of the problem is shown using a Python implementation of the basic cover tree algorithms.
متن کاملA POLYNOMIAL TRANSFORMATION FROM VERTEX COVER PROBLEM TO EXACT INFERENCE PROBLEM IN BAYESIAN BELIEF NETWORKS by
Exact Inference problem in Belief Networks has been well studied in the literature and has various application areas. In this thesis, a polynomial time transformation from Vertex Cover Problem to Exact Inference problem in Belief Networks is proposed and proved. To understand and see the development of the transformation, some well-known transformations about Vertex Cover Problem and Exact Infe...
متن کاملA Parallel Programming Approach to Solve the Exact Cover Problem
In this paper we present the solution of large exact cover problem using Message Passing Interface. The exact cover problem is a kind of constraint satisfaction problem. The exact cover problem is mathematically interesting to solve different mathematical puzzles and may arise practical interests in different fields. The exact cover problem is NPcomplete and the computational complexity to solv...
متن کاملSolving the set cover problem and the problem of exact 3 cover by 3 - sets in the Adleman – Lipton model
9 Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the D...
متن کاملAn exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem
In this paper, we will introduce an exact algorithm with a time complexity of O(1.299) for the weighted mutually exclusive set cover problem, where m is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1010.5890 شماره
صفحات -
تاریخ انتشار 2010